﻿//
//
//
////#include<stdio.h>
////struct man {
////    char name[20];
////    int x;
////    int y;
////};
////
////int main()
////{
////    int n = 0;
////    int count = 0;
////    scanf("%d", &n);
////    struct man m[1001];
////    int i = 0;
////    for (i = 0; i < n; i++)
////    {
////        scanf("%s %d %d", m[i].name, &m[i].x, &m[i].y);
////        if (m[i].x < 15 || m[i].x > 20 || m[i].y < 50 && m[i].y > 70)
////        {
////            count = 1;
////        }
////
////        if (count == 1)
////        {
////            printf("%s\n", m[i].name);
////        }
////
////        count = 0;
////    }
////    return 0;
////}
//
//
//#include <stdio.h>
//
//
//
//
//
////void fund(int p[3][4], int row, int col, int* pa, int* pb, int key) {
////
////
////
////
////
////    for (int i = 0; i < row; i++) {
////        if (key <= (*(p + i)[col - 1])) {
////            for (int j = col - 1; j >= 0; j--) {
////                if (*(p + i)[j] == key) {
////                    *pa = (i + 1);
////                    *pb = (j + 1);
////
////                }
////            }
////        }
////
////    }
////}
////
////int main() {
////    int arr1[3][4] = { {1,2,3,4},{5,6,7,8},{9,10,11,12} };
////    int a = 0;
////    int b = 0;
////    int m = 0;
////    printf("请输入要找的数字:\n");
////    scanf("%d", &m);
////
////    fund(arr1, 3, 4, &a, &b, m);
////    if (a == 0 && b == 0) {
////        printf("找不到");
////    }
////    else printf("行数:%d 列数:%d", a, b);
////    return 0;
////}
//
//
//
//
////int main()
////{
////	int arr[6];
////	for (int i = 0; i < 6; i++)
////	{
////		scanf("%d", &arr[i]);
////	}
////
////	return 0;
////}
// 
//
//
//
//
//
//
////#include <stdio.h>
////#include <string.h>
////struct stu
////{
////    char name[20];
////    int age;
////};
////int cmp_stu_by_name(const void* p1, const void* p2)
////{
////    return strcmp(((struct stu*)p1)->name, ((struct stu*)p2)->name);
////}
////int cmp_stu_by_age(const void* p1, const void* p2)
////{
////    return ((struct stu*)p1)->age - ((struct stu*)p2)->age;
////}
////int cmp_int(const void* p1, const void* p2)
////{
////    return *(int*)p1 - *(int*)p2;
////}
////void swap(char* buf1, char* buf2, size_t width)
////{
////    for (int i = 0; i < width; i++)
////    {
////        char tmp = *buf1;
////        *buf1 = *buf2;
////        *buf2 = tmp;
////    }
////}
////void bubble_sort(void* base, size_t sz, size_t width, int(*cmp)(const void* p1, const void* p2))
////{
////    //趟数
////    for (int i = 0; i < sz - 1; i++)
////    {
////        //一趟两两比较
////        for (int j = 0; j < sz - 1 - i; j++)
////        {
////            //比较arr[j] 和 arr[j+1]
////            if (cmp((char*)base + j * width, (char*)base + (j + 1) * width) > 0)
////            {
////                //交换两个元素
////                swap((char*)base + j * width, (char*)base + (j + 1) * width, width);
////            }
////        }
////    }
////}
//
////void test3()
////{
////        int arr[] = { 3,1,7,8,5,2,4,9,0,6 };
////        int sz = sizeof(arr) / sizeof(arr[0]);
////        bubble_sort(arr, sz, sizeof(arr[0]), cmp_int);
////        print_arr(arr, sz);
////}
//
////void test4()
////{
////    struct Stu arr[2] = { {"zhangsan", 20},{"lisi", 35},{"wangwu", 18} };
////    int sz = sizeof(arr) / sizeof(arr[0]);
////    bubble_sort(arr, sz, sizeof(arr[0]), cmp_stu_by_name);
////    //bubble_sort(arr, sz, sizeof(arr[0]), cmp_stu_by_age);
////}
////
////
////int main()
////{
////    //冒泡排序
////    //test3();//整形数据排序
////    test4();//结构体数据排序
////    return 0;
////}
//
//
//
//struct ListNode 
//{
//	int val;
//	struct ListNode* next;
//};
// 
//
////struct ListNode* reverseBetween(struct ListNode* head, int m, int n) {
////	if (head == NULL) {
////		return head;
////	}
////	if (head->next == NULL) {
////		return head;
////	}
////	if (n == m) {
////		return head;
////	}
////
////	struct ListNode* save = NULL;
////	struct ListNode* cur = NULL;
////	struct ListNode* cur1 = head;
////	struct ListNode* cur2 = NULL;
////	struct ListNode* cur3 = NULL;
////	int i = 0;
////
////	while (head->next) {
////		i++;
////		if (i == m) {
////			cur3 = head;
////		}
////		if (i >= m && i <= n) {
////			head->next = cur2;
////			cur2 = head;
////			if (i == n) {
////				save = head;
////				cur = head->next;
////			}
////		}
////		head = head->next;
////	}
////
////	if (cur3 == cur1) {
////		cur1->next = cur;
////		return save;
////	}
////	else if (cur3 == cur1 && save->next == NULL) {
////		return head;
////	}
////	else {
////		cur3->next = cur;
////		cur1->next = save;
////	}
////	return cur1;
////
////	// write code here
////}
//
//
//
//
//
//
//
//
////
////#include <stdio.h>
////#include <string.h>
////struct stu
////{
////    char name[20];
////    int age;
////};
////int cmp_stu_by_name(const void* p1, const void* p2)
////{
////    return strcmp(((struct stu*)p1)->name, ((struct stu*)p2)->name);
////}
////int cmp_stu_by_age(const void* p1, const void* p2)
////{
////    return ((struct stu*)p1)->age - ((struct stu*)p2)->age;
////}
////int cmp_int(const void* p1, const void* p2)
////{
////    //printf("%d----- ----%d\n", *(int*)p1, *(int*)p2);
////    return *(int*)p1 - *(int*)p2;
////}
////
////void swap(char* buf1, char* buf2, size_t width)
////{
////
////    for (int i = 0; i < width; i++)
////    {
////        char tmp = *buf1;
////        *buf1 = *buf2;
////        *buf2 = tmp;
////
////        buf1 = (char*)buf1 + 1;
////        buf2 = (char*)buf2 + 1;
////    }
////}
////
////
////void bubble_sort(void* base, size_t sz, size_t width, int(*cmp)(const void* p1, const void* p2))
////{
////    //趟数
////    for (int i = 0; i < sz - 1; i++)
////    {
////        //一趟两两比较
////        for (int j = 0; j < sz - 1 - i; j++)
////        {
////            //比较arr[j] 和 arr[j+1]
////            if (cmp((char*)base + j * width, (char*)base + (j + 1) * width) > 0)
////            {
////                //交换两个元素
////                swap((char*)base + j * width, (char*)base + (j + 1) * width, width);
////            }
////        }
////    }
////}
////void print_arr(int* arr, size_t sz)
////{
////    for (int i = 0; i < sz; i++)
////    {
////        printf("%d", arr[i]);
////    }
////    //printf("\n*********\n");
////}
////
////
////void test3()
////{
////    int arr[] = { 3,1,7,8,5,2,4,9,0,6 };
////    int sz = sizeof(arr) / sizeof(arr[0]);
////    bubble_sort(arr, sz, sizeof(arr[0]), cmp_int);
////    print_arr(arr, sz);
////}
////
////
////void test4()
////{
////    struct stu arr[3] = { {"zhangsan", 20},{"lisi", 35},{"wangwu", 18} };
////    int sz = sizeof(arr) / sizeof(arr[0]);
////    bubble_sort(arr, sz, sizeof(arr[0]), cmp_stu_by_name);
////    struct stu* p = arr;
////    for (p = arr; p < &arr[3]; p++)
////    {
////        printf("%s,%d\n", (*p).name, (*p).age);
////    }
////    puts("*********");
////    bubble_sort(arr, sz, sizeof(arr[0]), cmp_stu_by_age);
////    for (p = arr; p < &arr[3]; p++)
////    {
////        printf("%s,%d\n", (*p).name, (*p).age);
////    }
////}
////
////
////int main()
////{
////    //冒泡排序
////    test3();//整形数据排序
////    //test4();//结构体数据排序
////    return 0;
////}
//
//
//
//
//
//
//#define _CRT_SECURE_NO_WARNINGS 1
//#include <stdio.h>
//void bubble_sort(int arr[], int sz)
//{
//    int flag;
//    for (int i = 0; i < sz - 1; i++) {
//        flag = 1;
//        for (int j = 0; j < sz - 1 - i; j++) {
//            if (arr[j] > arr[j + 1]) {
//                int tmp = arr[j];
//                arr[j] = arr[j + 1];
//                arr[j + 1] = tmp;
//                flag = 0;
//            }
//            if (flag == 1)
//                break;
//        }
//        //return 0;
//    }
//}
//
//    // 打印数组
//    void print_array(int arr[], int sz) 
//    {
//
//        for (int i = 0; i < sz; i++) {
//            printf("%d ", arr[i]);
//        }
//        printf("\n");
//    }
//
//    int main() {
//        int arr[10];
//        int sz = sizeof(arr) / sizeof(arr[0]);
//
//        printf("请输入10个整数:\n");
//        for (int i = 0; i < sz; i++) {
//            scanf("%d", &arr[i]);
//        }
//
//        bubble_sort(arr, sz); // 调用冒泡排序函数
//        print_array(arr, sz); // 打印排序后的数组
//
//        return 0;
//    }
//    



#include <stdio.h>
//
//int main()
//{
//	int i = 0;
//
//	printf("%d\n", sizeof(i++));
//	printf("%d\n", i);
//
//	return 0;
//}




//
//int findthenum(int arr[4][4], int I, int J, int key)
//{
//    int i = 0;
//    int j = J - 1;
//    //锁定每一行最大的数
//
//    if ((key > arr[I - 1][J - 1]) || (key < arr[0][0]))
//        return 0;
//    //由于是递增矩阵，所以直接和最大的值和最小的值进行比较，就可以得知存不存在
//    //存在后再进行查找
//    else
//    {
//        while (key > arr[i][j] && i < I - 1)
//        {
//
//            i++;
//
//        }
//
//        j = 0;
//        while (key != arr[i][j] && j < J - 1)
//        {
//            j++;
//        }
//
//        return 1;
//    }
//}
//int main()
//{
//    int arr[4][4] = { 1,2,3,4,5,6,7,8,9,10 };//随意设置矩阵
//    int key = 7;//随意设置查找数
//
//    int ret = findthenum(arr, 4, 4, key);
//    printf("%d", ret);
//
//
//    return 0;
//}





//
//#include <stdio.h>
//#include <locale.h>
//
//
//int main() 
//{
//	setlocale(LC_ALL, "");
//	wchar_t ch1 = L'●';
//	wchar_t ch2 = L'⽐';
//	wchar_t ch3 = L'特';
//	wchar_t ch4 = L'★';
//
//	printf("%c%c\n", 'a', 'b');
//
//	wprintf(L"%lc\n", ch1);
//	wprintf(L"%lc\n", ch2);
//	wprintf(L"%lc\n", ch3);
//	wprintf(L"%lc\n", ch4);
//	return 0;
//}
//









#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct
{
    char book_number[20];
    char book_name[20];
    int  book_price;
}book;

typedef struct
{
    book* a;
    int length;
}Sqlist;

void bo_book(Sqlist* p)
{
    p->a = (book*)malloc(sizeof(book) * 100);
    p->length = 0;
}

void writeList(Sqlist* p, int n)
{
    printf("请输入你要创建的顺序表的长度:");
    scanf("%d", &n);
    printf("书号： 书名： 价格：\n");
    for (int i = 0; i < n; i++)
    {
        scanf("%s %s %d", p->a[i].book_number, p->a[i].book_name, &(p->a[i].book_price));
        p->length++;
    }
}

void price_cmp(Sqlist* p)
{
    int max = 0;
    int i = 0;
    for (i = 0; i < (p->length); i++)
    {
        if (p->a[i].book_price > max)
        {
            max = p->a[i].book_price;
        }
    }
    for (i = 0; i < p->length; i++)
    {
        if (p->a[i].book_price == max)
        {
            strcpy(p->a[i].book_number, "9980123");
        }
    }
}

void printList(Sqlist* p)
{
    printf("书号： 书名： 价格：\n");
    for (int i = 0; i < p->length; i++)
    {
        printf("%s %s %d", p->a[i].book_number, p->a[i].book_name, p->a[i].book_price);
        printf("\n");
    }
}

//int main()
//{
//    Sqlist p;
//    int n = 0;
//    bo_book(&p);
//    writeList(&p, n);
//
//    price_cmp(&p);
//    printList(&p);
//
//    return 0;
//}


int main()
{
    int EASY_COUNT = 0 ,win = 0 ,col,row;

    while (win < row * col - EASY_COUNT)
    {
    }

    return 0;
}